Some Considerations About NPRIORITY(1) Without ROM

Li and Yesha ]5,6] investigated many computational time bounds of variants of parallel random access machines (PRAMS), and improved upper and lower bounds [2,3,7]. In [5,6], they proved a tight lower bound of 8(G) for PARITY on nondeterministic PRIORITY(~) (for short, NPRIORITY(~)) without ROM, which is a kind of nondeterministic concurrent-read concurrent-write PRAM. This article observes some computational time bounds of NPRIORITY(~) without ROM: (1) nondeterministic one-way pushdown automata can be simulated by NPRIORITY(~)‘S without ROM in O(G) time (this time bound is tight), and (2) for each k (3 < k G n), &/m) time is required to compute any k-sensitive everywhere function with n variables (to be defined below) by an NPNORiTY(l) without ROM M, where d > 1 is the branching factor of M.